#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> oset;
int main(void)
{
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int a,b,c,d,e,f,g,h,j;
string str,str2;
cin>>a;
while(a--)
{
cin>>str;
b=str.size();
d=0;//ans
e=2e9;
f=0;
bool fl=false;
for(c=0;c<b;c++)
{
if(str[c]=='A')
{
++d;
++f;
}
else
{
if(c!=0 && g=='B')
fl=true;
if(g!='B')
{
e=min(e,f);
f=0;
}
}
g=str[c];
}
if(f!=0)
e=min(e,f);
if(str[0]=='B' || str[b-1]=='B')
fl=true;
if(fl)
cout<<d<<"\n";
else
cout<<d-e<<"\n";
}
return 0;
}
Back to School | I am Easy |
Teddy and Tweety | Partitioning binary strings |
Special sets | Smallest chosen word |
Going to office | Color the boxes |
Missing numbers | Maximum sum |
13 Reasons Why | Friend's Relationship |
Health of a person | Divisibility |
A. Movement | Numbers in a matrix |
Sequences | Split houses |
Divisible | Three primes |
Coprimes | Cost of balloons |
One String No Trouble | Help Jarvis! |
Lift queries | Goki and his breakup |
Ali and Helping innocent people | Book of Potion making |
Duration | Birthday Party |